Correlation-based heuristics and evaluation of existing greedy heuristics for VM allocations in cloud datacentres
نویسندگان
چکیده
منابع مشابه
Concatenation - Based Greedy Heuristics for the Euclidean
We present a class of O(n log n) heuristics for the Steiner tree problem in the Euclidean plane. These heuristics identify a small number of subsets with few, geometrically close, terminals using minimum spanning trees and other well-known structures from computational geometry: De-launay triangulations, Gabriel graphs, relative neighbourhood graphs, and higher-order Voronoi diagrams. Full Stei...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملGreedy Heuristics for Degenerate Primer Selection
Amplification of multiple DNA sequences in a single Polymerase Chain Reaction (PCR) experiment, called Multiplex PCR (MPPCR), is a widely known laboratory technique that requires efficient selection of a set of synthetic strings called Degenerate Primers to result in successful PCR products. The Multiple Degenerate Primer Selection Problem (MDPSP) is a fundamental problem in molecular biology a...
متن کاملProbabilistic Greedy Heuristics for Satisfiability Problems
We examine probabilistic greedy heuristics for maximization and minimization versions of the satisfiability problem. Like deterministic greedy algorithms, these heuristics construct a truth assignment one variable at a time. Unlike them, they set a variable true or false using a probabilistic mechanism, the probabilities of a true assignment depending on the incremental number of clauses satisf...
متن کاملGreedy, Prohibition, and Reactive Heuristics for Graph Partitioning
ÐNew heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction scheme with an appropriate tie-breaking rule (MIN-MAX-GREEDY) produces initial assignments in a very fast time. For some classes of graphs, independent repetitions of MIN-MAX-GREEDY are sufficient to reproduce solutions found by more complex techniques. When the method is not competitive, the initia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Technology, Communications and Convergence
سال: 2020
ISSN: 2042-3217,2042-3225
DOI: 10.1504/ijitcc.2020.112454